package demo.practice.leetcode_offer;

import demo.practice.ListNode;

public class Offer25 {

    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {

        ListNode newhead = new ListNode(0);
        ListNode cur = newhead;

        while (l1 != null && l2 != null) {

            /*if (l1 == null) {
                cur = l2;
                l2 = l2.next;
            } else if (l2 == null) {
                cur = l1.next;
                l1 = l1.next;
            }*/

            if (l1.val < l2.val) {
                cur.next = l1;
                l1 = l1.next;
            } else {
                cur.next = l2;
                l2 = l2.next;
            }

            cur = cur.next;
        }
        cur.next = l1 != null ? l1 : l2;

        return newhead.next;

    }


}
